Idempotent and co-idempotent stack filters and min-max operators
نویسنده
چکیده
Viewing the elements of R as images f with pixels i∈ S of grey-scale value f(i) motivates the study of certain nonlinear operators :R → R . For translation invariant (called stack #lters in the signal processing literature) we derive the #rst necessary and su1cient condition for idempotency which can be tested in polynomial time. Various related properties can be tested in polynomial time as well, and many results still apply when the linear lattice (R;6) is replaced by an arbitrary distributive lattice (R;6), or when the condition of translation invariance is dropped. Although the main application is in nonlinear image processing several other #elds will be touched upon. c © 2002 Elsevier Science B.V. All rights reserved. MSC: 68U10; 06E30; 06DXX; 06F20; 05C20; 20M20; 03E72
منابع مشابه
ar X iv : m at h / 02 06 02 5 v 1 [ m at h . R T ] 4 J un 2 00 2 IDEMPOTENT ( ASYMPTOTIC ) MATHEMATICS AND THE REPRESENTATION THEORY
1. Introduction. Idempotent Mathematics is based on replacing the usual arithmetic operations by a new set of basic operations (e.g., such as maximum or minimum), that is on replacing numerical fields by idempotent semirings and semifields. Typical (and the most common) examples are given by the so-called (max, +) algebra R max and (min, +) algebra R min. Let R be the field of real numbers. The...
متن کاملNuclear Semimodules and Kernel Theorems in Idempotent Analysis. an Algebraic Approach
In this note we describe conditions under which, in idempotent functional analysis (see [1–3]), linear operators have integral representations in terms of idempotent integral of V. P. Maslov. We define the notion of nuclear idempotent semimodule and describe idempotent analogs of the classical kernel theorems of L. Schwartz and A. Grothendieck (see, e.g., [4–6]). In [11], for the idempotent sem...
متن کاملIdempotent Method for Deception Games and Complexity Attenuation
We extend the applicability of idempotent methods to deterministic dynamic games through the min-max distributive property. This induces a very high curse-of-complexity. A representation of the space of max-plus hypo-convex functions as a min-max linear space is used to obtain a method for attenuating this complexity growth. This is applied in a game of search and deception. The problem is form...
متن کامل-Idempotent and Self-Dual Morphological Filters
In this paper, we present a comprehensive analysis of selfdual and m-idempotent operators. We refer to an operator as midempotent if it converges after m iterations. We focus on an important special case of the general theory of lattice morphology: Spatiallyvariant morphology, which captures the geometrical interpretation of spatially-variant structuring elements. We demonstrate that every incr...
متن کاملGenerating Idempotent Filters
Idempotent filters produce a root signal in a single filter pass, i.e., the filter output is invariant to further filterings with the same filter. In this paper median based idempotent filter structures are introduced. Two approaches to generate these filters are studied: weighted median filters and median filter cascades. Two subclasses of n-dimensional idempotent weighted median filters, call...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 299 شماره
صفحات -
تاریخ انتشار 2003